Fechar
Metadados

1. Identificação
Tipo de ReferênciaArtigo em Revista Científica (Journal Article)
Sitemtc-m21c.sid.inpe.br
Código do Detentorisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identificador8JMKD3MGP3W34R/423BQEE
Repositóriosid.inpe.br/mtc-m21c/2020/02.27.10.59   (acesso restrito)
Última Atualização2020:02.27.10.59.40 (UTC) simone
Repositório de Metadadossid.inpe.br/mtc-m21c/2020/02.27.10.59.40
Última Atualização dos Metadados2020:02.27.19.38.44 (UTC) administrator
DOI10.1007/s10836-019-05844-6
Chave de CitaçãoMarianoSouzEndoVija:2019:CoGrAl
TítuloComparing graph-based algorithms to generate test cases from finite state machines
Ano2019
MêsDec.
Data de Acesso07 maio 2024
Tipo de Trabalhojournal article
Número de Arquivos1
Tamanho3257 KiB
2. Contextualização
Autor1 Mariano, Matheus Monteiro
2 Souza, Érica Ferreira de
3 Endo, André Takeshi
4 Vijaykumar, Nandamudi Lankalapalli
Identificador de Curriculo1
2
3
4 8JMKD3MGP5W/3C9JHTU
ORCID1 0000-0002-6629-1846
Grupo1 CAP-COMP-SESPG-INPE-MCTIC-GOV-BR
2
3
4 LABAC-COCTE-INPE-MCTIC-GOV-BR
Afiliação1 Instituto Nacional de Pesquisas Espaciais (INPE)
2 Universidade Tecnológica Federal do Paraná (UTFPR)
3 Universidade Tecnológica Federal do Paraná (UTFPR)
4 Instituto Nacional de Pesquisas Espaciais (INPE)
Endereço de e-Mail do Autor1 matheus.mariano@inpe.br
2
3
4 vijay.nl@inpe.br
RevistaJournal of Electronic Testing Theory and Applications
Volume35
Número6
Páginas867-885
Histórico (UTC)2020-02-27 11:00:30 :: simone -> administrator :: 2019
2020-02-27 19:38:44 :: administrator -> simone :: 2019
3. Conteúdo e estrutura
É a matriz ou uma cópia?é a matriz
Estágio do Conteúdoconcluido
Transferível1
Tipo do ConteúdoExternal Contribution
Tipo de Versãopublisher
Palavras-ChaveSoftware testing
Model based testing
Finite state machine
Graph-based algorithms
ResumoModel-Based Testing (MBT) is a well-known technique that employs formal models to represent reactive systems' behavior and generates test cases. Such systems have been specified and verified using mostly Finite State Machines (FSMs). There is a plethora of test generation algorithms in the literature; most of them are based on graphs once an FSM can be formally defined as a graph. Nevertheless, there is a lack of studies on analyzing cost and efficiency of FSM-based test generation algorithms. This study compares graph-based algorithms adopted to generate test cases from FSM models. In particular, we compare the Chinese Postman Problem (CPP) and H-Switch Cover (HSC) algorithms with the well-known Depth-First Search (DFS) and Breadth-First Search (BFS) algorithms in the context of covering all-transitions and all-transition-pairs criteria in an FSM. First, a systematic literature mapping was conducted to summarize the methods that have been adopted in MBT, considering FSMs. Second, the main methods found were implemented and analyzed on randomly-generated FSMs, as well as real-world models that represent embedded systems of space applications. To make comparisons, we considered analyses in terms of cost (time), efficiency (mutant analysis) and characteristics of the generated test suites (number of test cases, average length of test cases, largest and smallest test cases, standard deviation and distribution of test cases). In general, CPP presented the best results in terms of number of test cases and test suite size. In addition, CPP also presented low distribution of average length compared to other algorithms.
ÁreaCOMP
Arranjo 1urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > Comparing graph-based algorithms...
Arranjo 2urlib.net > BDMCI > Fonds > Produção pgr ATUAIS > CAP > Comparing graph-based algorithms...
Conteúdo da Pasta docacessar
Conteúdo da Pasta sourcenão têm arquivos
Conteúdo da Pasta agreement
agreement.html 27/02/2020 07:59 1.0 KiB 
4. Condições de acesso e uso
Idiomaen
Arquivo Alvomariano_comparing.pdf
Grupo de Usuáriossimone
Grupo de Leitoresadministrator
simone
Visibilidadeshown
Permissão de Leituradeny from all and allow from 150.163
Permissão de Atualizaçãonão transferida
5. Fontes relacionadas
Repositório Espelhourlib.net/www/2017/11.22.19.04.03
Unidades Imediatamente Superiores8JMKD3MGPCW/3ESGTTP
8JMKD3MGPCW/3F2PHGS
Lista de Itens Citandosid.inpe.br/bibdigital/2013/10.12.22.16 2
sid.inpe.br/bibdigital/2013/09.22.23.14 1
sid.inpe.br/mtc-m21/2012/07.13.14.56.50 1
Acervo Hospedeirourlib.net/www/2017/11.22.19.04
6. Notas
Campos Vaziosalternatejournal archivingpolicy archivist callnumber copyholder copyright creatorhistory descriptionlevel dissemination e-mailaddress format isbn issn label lineage mark nextedition notes parameterlist parentrepositories previousedition previouslowerunit progress project rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype session shorttitle sponsor subject tertiarymark tertiarytype url
7. Controle da descrição
e-Mail (login)simone
atualizar 


Fechar